Meta-Heuristics Algorithms based on the Grouping of Animals by Social Behavior for the Traveling Salesman Problem
نویسندگان
چکیده
In this paper, we show a survey of meta-heuristics algorithms based on grouping of animals by social behavior for the Traveling Salesman Problem, and propose a new classification of meta-heuristics algorithms (not based on swarm intelligence theory) based on grouping of animals: swarm algorithms, schools algorithms, flocks algorithms and herds algorithms: a) The swarm algorithms (inspired by the insect swarms and zooplankton swarms): Ant Colony Optimization algorithm – ACO (inspired by the research on the behavior of ant colonies), Firefly Algorithm (based on fireflies), Marriage in Honey Bees Optimization Algorithm MBO algorithm (inspired by the Honey Bee), Wasp Swarm Algorithm (inspired on the Parasitic wasps), Termite Algorithm (inspired by the termites), Mosquito swarms Algorithm – MSA (inspired by mosquito swarms), zooplankton swarms Algorithm ZSA (inspired by the Zooplankton) and Bumblebees Swarms Algorithm – BSA (inspired by Bumblebees). b) The school algorithms (inspired by the fish schools): The Particle Swarm Optimization algorithm – PSO (inspired by social behavior and movement dynamics of fish or schooling). c) The flock algorithms (inspired by the bird flocks): the flocking algorithm, and the Particle Swarm Optimization algorithm (inspired on the dynamics of the birds), d) The herd and pack Algorithms (inspired by the mammal herds and packs): bat algorithm (inspired by bat), wolf pack search algorithm WPS (inspired by wolfs), Rats herds algorithm RATHA (inspired by Rats), Dolphins Herds Algorithm DHA (inspired by Dolphins) and the feral-dogs herd algorithm FDHA (inspired by feral-dogs herd).
منابع مشابه
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملA Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملA reactive bone route algorithm for solving the traveling salesman problem
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
متن کاملSolving Traveling Salesman Problem based on Biogeography-based Optimization and Edge Assembly Cross-over
Biogeography-Based Optimization (BBO) algorithm has recently been of great interest to researchers for simplicity of implementation, efficiency, and the low number of parameters. The BBO Algorithm in optimization problems is one of the new algorithms which have been developed based on the biogeography concept. This algorithm uses the idea of animal migration to find suitable habitats for solvin...
متن کاملAN EFFICIENT CROSSOVER OPERATOR FOR TRAVELING SALESMAN PROBLEM
Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJCOPI
دوره 3 شماره
صفحات -
تاریخ انتشار 2012